0.00/0.12	% Problem    : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.00/0.13	% Command    : eprover-ho %s --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --free-numbers -auto-schedule -p --cpu-limit=%d --neg-ext=all --pos-ext=all --ext-sup-max-depth=2 --schedule-kind=CASC
0.11/0.34	% Computer   : n014.cluster.edu
0.11/0.34	% Model      : x86_64 x86_64
0.11/0.34	% CPU        : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
0.11/0.34	% Memory     : 8042.1875MB
0.11/0.34	% OS         : Linux 3.10.0-693.el7.x86_64
0.11/0.34	% CPULimit   : 1200
0.11/0.34	% WCLimit    : 120
0.11/0.34	% DateTime   : Tue Jul 13 10:36:34 EDT 2021
0.11/0.34	% CPUTime    : 
0.11/0.34	% Number of cores: 8
0.11/0.34	% Python version: Python 3.6.8
0.11/0.34	# Version: 2.6rc1-ho
0.11/0.34	# No SInE strategy applied
0.11/0.34	# Trying AutoSched0 for 59 seconds
0.11/0.38	# AutoSched0-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S088N
0.11/0.38	# and selection function SelectCQArNTEqFirstUnlessPDom.
0.11/0.38	#
0.11/0.38	# Preprocessing time       : 0.028 s
0.11/0.38	# Presaturation interreduction done
0.11/0.38	
0.11/0.38	# Proof found!
0.11/0.38	# SZS status Theorem
0.11/0.38	# SZS output start CNFRefutation
0.11/0.38	thf(breln1, axiom, (breln1)=(^[X1:$i, X9:$i]:subset @ X9 @ (cartprod @ X1 @ X1)), file('/export/starexec/sandbox/benchmark/theBenchmark.p', breln1)).
0.11/0.38	thf(breln, axiom, (breln)=(^[X1:$i, X2:$i, X3:$i]:subset @ X3 @ (cartprod @ X1 @ X2)), file('/export/starexec/sandbox/benchmark/theBenchmark.p', breln)).
0.11/0.38	thf(breln1invI, conjecture, (dpsetconstrI=>![X1:$i, X9:$i]:(![X5:$i]:(in @ X5 @ X1=>![X6:$i]:(in @ X6 @ X1=>(in @ (kpair @ X6 @ X5) @ (breln1invset @ X1 @ X9)<=in @ (kpair @ X5 @ X6) @ X9)))<=breln1 @ X1 @ X9)), file('/export/starexec/sandbox/benchmark/theBenchmark.p', breln1invI)).
0.11/0.38	thf(dpsetconstrI, axiom, (dpsetconstrI<=>![X1:$i, X2:$i, X4:$i > $i > $o, X5:$i]:(in @ X5 @ X1=>![X6:$i]:(in @ X6 @ X2=>(X4 @ X5 @ X6=>in @ (kpair @ X5 @ X6) @ (dpsetconstr @ X1 @ X2 @ (^[X7:$i, X8:$i]:X4 @ X7 @ X8)))))), file('/export/starexec/sandbox/benchmark/theBenchmark.p', dpsetconstrI)).
0.11/0.38	thf(breln1invset, axiom, (breln1invset)=(^[X1:$i, X9:$i]:dpsetconstr @ X1 @ X1 @ (^[X5:$i, X6:$i]:in @ (kpair @ X6 @ X5) @ X9)), file('/export/starexec/sandbox/benchmark/theBenchmark.p', breln1invset)).
0.11/0.38	thf(c_0_5, axiom, (breln1)=(^[X1:$i, X9:$i]:subset @ X9 @ (cartprod @ X1 @ X1)), inference(apply_def,[status(thm)],[breln1, breln])).
0.11/0.38	thf(c_0_6, plain, ![X8:$i, X7:$i, X4:$i > $i > $o]:(epred2_3 @ X4 @ X7 @ X8<=>X4 @ X7 @ X8), introduced(definition)).
0.11/0.38	thf(c_0_7, plain, ![X20:$i, X19:$i, X9:$i]:(epred1_3 @ X9 @ X19 @ X20<=>in @ (kpair @ X20 @ X19) @ X9), introduced(definition)).
0.11/0.38	thf(c_0_8, negated_conjecture, ~((![X1:$i, X2:$i, X4:$i > $i > $o, X5:$i]:(in @ X5 @ X1=>![X6:$i]:(in @ X6 @ X2=>(X4 @ X5 @ X6=>in @ (kpair @ X5 @ X6) @ (dpsetconstr @ X1 @ X2 @ (epred2_3 @ X4)))))=>![X1:$i, X9:$i]:(subset @ X9 @ (cartprod @ X1 @ X1)=>![X5:$i]:(in @ X5 @ X1=>![X6:$i]:(in @ X6 @ X1=>(in @ (kpair @ X5 @ X6) @ X9=>in @ (kpair @ X6 @ X5) @ (breln1invset @ X1 @ X9))))))), inference(fof_simplification,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(assume_negation,[status(cth)],[breln1invI]), dpsetconstrI]), c_0_5]), c_0_6])])).
0.11/0.38	thf(c_0_9, plain, ![X1:$i, X9:$i]:(breln1invset @ X1 @ X9)=(dpsetconstr @ X1 @ X1 @ (epred1_3 @ X9)), inference(apply_def,[status(thm)],[inference(fof_simplification,[status(thm)],[breln1invset]), c_0_7])).
0.11/0.38	thf(c_0_10, negated_conjecture, ![X23:$i, X24:$i, X25:$i > $i > $o, X26:$i, X27:$i]:((~in @ X26 @ X23|(~in @ X27 @ X24|(~X25 @ X26 @ X27|in @ (kpair @ X26 @ X27) @ (dpsetconstr @ X23 @ X24 @ (epred2_3 @ X25)))))&(subset @ esk2_0 @ (cartprod @ esk1_0 @ esk1_0)&(in @ esk3_0 @ esk1_0&(in @ esk4_0 @ esk1_0&(in @ (kpair @ esk3_0 @ esk4_0) @ esk2_0&~in @ (kpair @ esk4_0 @ esk3_0) @ (breln1invset @ esk1_0 @ esk2_0)))))), inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_8])])])])).
0.11/0.38	thf(c_0_11, plain, ![X21:$i, X22:$i]:(breln1invset @ X21 @ X22)=(dpsetconstr @ X21 @ X21 @ (epred1_3 @ X22)), inference(variable_rename,[status(thm)],[c_0_9])).
0.11/0.38	thf(c_0_12, negated_conjecture, ![X2:$i, X1:$i, X5:$i, X4:$i > $i > $o, X3:$i]:(in @ (kpair @ X1 @ X3) @ (dpsetconstr @ X2 @ X5 @ (epred2_3 @ X4))|~in @ X1 @ X2|~in @ X3 @ X5|~X4 @ X1 @ X3), inference(split_conjunct,[status(thm)],[c_0_10])).
0.11/0.38	thf(c_0_13, plain, ![X1:$i, X2:$i]:(breln1invset @ X1 @ X2)=(dpsetconstr @ X1 @ X1 @ (epred1_3 @ X2)), inference(split_conjunct,[status(thm)],[c_0_11])).
0.11/0.38	thf(c_0_14, negated_conjecture, ~in @ (kpair @ esk4_0 @ esk3_0) @ (breln1invset @ esk1_0 @ esk2_0), inference(split_conjunct,[status(thm)],[c_0_10])).
0.11/0.38	thf(c_0_15, plain, ![X1:$i, X5:$i, X4:$i > $i > $o, X3:$i, X2:$i]:(in @ (kpair @ X1 @ X2) @ (breln1invset @ X3 @ X5)|(epred1_3 @ X5)!=(epred2_3 @ X4)|~in @ X2 @ X3|~in @ X1 @ X3|~X4 @ X1 @ X2), inference(er,[status(thm)],[inference(er,[status(thm)],[inference(ext_sup,[status(thm)],[c_0_12, c_0_13])])])).
0.11/0.38	thf(c_0_16, negated_conjecture, in @ esk3_0 @ esk1_0, inference(split_conjunct,[status(thm)],[c_0_10])).
0.11/0.38	thf(c_0_17, negated_conjecture, in @ esk4_0 @ esk1_0, inference(split_conjunct,[status(thm)],[c_0_10])).
0.11/0.38	thf(c_0_18, negated_conjecture, ![X4:$i > $i > $o]:((epred2_3 @ X4)!=(epred1_3 @ esk2_0)|~X4 @ esk4_0 @ esk3_0), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14, c_0_15]), c_0_16]), c_0_17])])).
0.11/0.38	thf(c_0_19, plain, ![X32:$i, X33:$i, X34:$i]:((~epred1_3 @ X34 @ X33 @ X32|in @ (kpair @ X32 @ X33) @ X34)&(~in @ (kpair @ X32 @ X33) @ X34|epred1_3 @ X34 @ X33 @ X32)), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_7])])).
0.11/0.38	thf(c_0_20, negated_conjecture, ![X4:$i > $i > $o]:((epred2_3 @ X4 @ (esk7_1 @ X4) @ (esk8_1 @ X4))!=(epred1_3 @ esk2_0 @ (esk7_1 @ X4) @ (esk8_1 @ X4))|~X4 @ esk4_0 @ esk3_0), inference(neg_ext,[status(thm)],[c_0_18])).
0.11/0.38	thf(c_0_21, plain, ![X1:$i, X2:$i, X3:$i]:(epred1_3 @ X3 @ X2 @ X1|~in @ (kpair @ X1 @ X2) @ X3), inference(split_conjunct,[status(thm)],[c_0_19])).
0.11/0.38	thf(c_0_22, negated_conjecture, in @ (kpair @ esk3_0 @ esk4_0) @ esk2_0, inference(split_conjunct,[status(thm)],[c_0_10])).
0.11/0.38	thf(c_0_23, plain, ![X35:$i, X36:$i, X37:$i > $i > $o]:((~epred2_3 @ X37 @ X36 @ X35|X37 @ X36 @ X35)&(~X37 @ X36 @ X35|epred2_3 @ X37 @ X36 @ X35)), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_6])])).
0.11/0.38	thf(c_0_24, negated_conjecture, ![X4:$i > $i > $o]:(epred1_3 @ esk2_0 @ (esk7_1 @ X4) @ (esk8_1 @ X4)|epred2_3 @ X4 @ (esk7_1 @ X4) @ (esk8_1 @ X4)|~X4 @ esk4_0 @ esk3_0), inference(dynamic cnf,[status(thm)],[c_0_20])).
0.11/0.38	thf(c_0_25, negated_conjecture, epred1_3 @ esk2_0 @ esk4_0 @ esk3_0, inference(spm,[status(thm)],[c_0_21, c_0_22])).
0.11/0.38	thf(c_0_26, plain, ![X1:$i, X4:$i > $i > $o, X2:$i]:(epred2_3 @ X4 @ X1 @ X2|~X4 @ X1 @ X2), inference(split_conjunct,[status(thm)],[c_0_23])).
0.11/0.38	thf(c_0_27, plain, ![X1:$i, X4:$i > $i > $o, X2:$i]:(X4 @ X1 @ X2|~epred2_3 @ X4 @ X1 @ X2), inference(split_conjunct,[status(thm)],[c_0_23])).
0.11/0.38	thf(c_0_28, negated_conjecture, epred2_3 @ (epred1_3 @ esk2_0) @ (esk7_1 @ (epred1_3 @ esk2_0)) @ (esk8_1 @ (epred1_3 @ esk2_0)), inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_24, c_0_25]), c_0_26])).
0.11/0.38	thf(c_0_29, negated_conjecture, ![X4:$i > $i > $o]:(~epred1_3 @ esk2_0 @ (esk7_1 @ X4) @ (esk8_1 @ X4)|~epred2_3 @ X4 @ (esk7_1 @ X4) @ (esk8_1 @ X4)|~X4 @ esk4_0 @ esk3_0), inference(dynamic cnf,[status(thm)],[c_0_20])).
0.11/0.38	thf(c_0_30, plain, epred1_3 @ esk2_0 @ (esk7_1 @ (epred1_3 @ esk2_0)) @ (esk8_1 @ (epred1_3 @ esk2_0)), inference(spm,[status(thm)],[c_0_27, c_0_28])).
0.11/0.38	thf(c_0_31, negated_conjecture, ($false), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29, c_0_30]), c_0_28]), c_0_25])]), ['proof']).
0.11/0.38	# SZS output end CNFRefutation
0.11/0.38	# Proof object total steps             : 32
0.11/0.38	# Proof object clause steps            : 18
0.11/0.38	# Proof object formula steps           : 14
0.11/0.38	# Proof object conjectures             : 15
0.11/0.38	# Proof object clause conjectures      : 12
0.11/0.38	# Proof object formula conjectures     : 3
0.11/0.38	# Proof object initial clauses used    : 9
0.11/0.38	# Proof object initial formulas used   : 5
0.11/0.38	# Proof object generating inferences   : 5
0.11/0.38	# Proof object simplifying inferences  : 9
0.11/0.38	# Training examples: 0 positive, 0 negative
0.11/0.38	# Parsed axioms                        : 14
0.11/0.38	# Removed by relevancy pruning/SinE    : 0
0.11/0.38	# Initial clauses                      : 20
0.11/0.38	# Removed in clause preprocessing      : 9
0.11/0.38	# Initial clauses in saturation        : 11
0.11/0.38	# Processed clauses                    : 53
0.11/0.38	# ...of these trivial                  : 0
0.11/0.38	# ...subsumed                          : 0
0.11/0.38	# ...remaining for further processing  : 53
0.11/0.38	# Other redundant clauses eliminated   : 10
0.11/0.38	# Clauses deleted for lack of memory   : 0
0.11/0.38	# Backward-subsumed                    : 0
0.11/0.38	# Backward-rewritten                   : 0
0.11/0.38	# Generated clauses                    : 136
0.11/0.38	# ...of the previous two non-trivial   : 63
0.11/0.38	# Contextual simplify-reflections      : 1
0.11/0.38	# Paramodulations                      : 52
0.11/0.38	# Factorizations                       : 0
0.11/0.38	# NegExts                              : 5
0.11/0.38	# Equation resolutions                 : 10
0.11/0.38	# Propositional unsat checks           : 0
0.11/0.38	#    Propositional check models        : 0
0.11/0.38	#    Propositional check unsatisfiable : 0
0.11/0.38	#    Propositional clauses             : 0
0.11/0.38	#    Propositional clauses after purity: 0
0.11/0.38	#    Propositional unsat core size     : 0
0.11/0.38	#    Propositional preprocessing time  : 0.000
0.11/0.38	#    Propositional encoding time       : 0.000
0.11/0.38	#    Propositional solver time         : 0.000
0.11/0.38	#    Success case prop preproc time    : 0.000
0.11/0.38	#    Success case prop encoding time   : 0.000
0.11/0.38	#    Success case prop solver time     : 0.000
0.11/0.38	# Current number of processed clauses  : 40
0.11/0.38	#    Positive orientable unit clauses  : 8
0.11/0.38	#    Positive unorientable unit clauses: 0
0.11/0.38	#    Negative unit clauses             : 1
0.11/0.38	#    Non-unit-clauses                  : 31
0.11/0.38	# Current number of unprocessed clauses: 31
0.11/0.38	# ...number of literals in the above   : 114
0.11/0.38	# Current number of archived formulas  : 0
0.11/0.38	# Current number of archived clauses   : 13
0.11/0.38	# Clause-clause subsumption calls (NU) : 210
0.11/0.38	# Rec. Clause-clause subsumption calls : 178
0.11/0.38	# Non-unit clause-clause subsumptions  : 1
0.11/0.38	# Unit Clause-clause subsumption calls : 0
0.11/0.38	# Rewrite failures with RHS unbound    : 0
0.11/0.38	# BW rewrite match attempts            : 0
0.11/0.38	# BW rewrite match successes           : 0
0.11/0.38	# Condensation attempts                : 0
0.11/0.38	# Condensation successes               : 0
0.11/0.38	# Termbank termtop insertions          : 3190
0.11/0.38	
0.11/0.38	# -------------------------------------------------
0.11/0.38	# User time                : 0.029 s
0.11/0.38	# System time              : 0.006 s
0.11/0.38	# Total time               : 0.035 s
0.11/0.38	# Maximum resident set size: 1652 pages
0.11/0.38	EOF